Geodetic work by using Satellite Laser Ranging and the Japanese Geodetic Satellite“AJISAI”

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geodetic Satellite Altimeter Study Final Engineering Report

This report presents the results of an eight-month study of signal processing techniques applicable to the Geodetic Satellite Altimeter program. The first subject treated is the analysis of random errors in the altitude measurement process which arise from signal fluctuations and receiver noise. Results are presented based on both theoretical analyses and computer simulation of the altimeter co...

متن کامل

On the edge geodetic and edge geodetic domination numbers of a graph

In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...

متن کامل

Geodetic Games

We show that the geodetic game, introduced by Fraenkel and Harary, is decidable in polynomial time on AT-free graphs.

متن کامل

Geodetic Graphs Homeomorphic to a Given Geodetic Graph

This paper describes a new approach to the problem of generating the class of all geodetic graphs homeomorphic to a given geodetic one. An algorithmic procedure is elaborated to carry out a systematic finding of such a class of graphs. As a result, the enumeration of the class of geodetic graphs homeomorphic to certain Moore graphs has been performed.

متن کامل

A Generalization of Geodetic Graphs: K{Geodetic Graphs

An undirected graph G = (V;E) is said to be geodetic, if between any pair of vertices x; y 2 V there is a unique shortest path. Generalizations of geodetic graphs are introduced in this paper. K-geodetic graphs are de ned as graphs in which every pair of vertices has at most k paths of minimum length between them. Some properties and characterizations of k{geodetic graphs are studied.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Japan society of photogrammetry and remote sensing

سال: 1987

ISSN: 0285-5844,1883-9061

DOI: 10.4287/jsprs.26.special1_49